Recursive Encoding and Decoding of Noiseless Subsystem and Decoherence Free Subspace
نویسندگان
چکیده
Chi-Kwong Li,1 Mikio Nakahara,2 Yiu-Tung Poon,3 Nung-Sing Sze,4 and Hiroyuki Tomita5 Department of Mathematics, College of William & Mary, Williamsburg, VA 23187-8795, USA.∗ Research Center for Quantum Computing and Department of Physics, Kinki University, 3-4-1 Kowakae, Higashi-Osaka, 577-8502, Japan.† Department of Mathematics, Iowa State University, Ames, IA 50051, USA.‡ Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Hong Kong.§ Research Center for Quantum Computing, Kinki University, 3-4-1 Kowakae, Higashi-Osaka, 577-8502, Japan.¶
منابع مشابه
Decoherence-Insensitive Quantum Communication by Optimal Cast-Encoding
The central issue in this article is to transmit a quantum state in such a way that after some decoherence occurs, most of the information can be restored by a suitable decoding operation. For this purpose, we incorporate redundancy by mapping a given initial quantum state to a messenger state on a larger-dimensional Hilbert space via a C∗-algebra embedding. Our noise model for the transmission...
متن کاملDecoherence-Insensitive Quantum Communication by Optimal C∗-Encoding
The central issue in this article is to transmit a quantum state in such a way that after some decoherence occurs, most of the information can be restored by a suitable decoding operation. For this purpose, we incorporate redundancy by mapping a given initial quantum state to a messenger state on a larger-dimensional Hilbert space via a C∗-algebra embedding. Our noise model for the transmission...
متن کاملEncoding Subsystem Codes
In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the known results on encoding of stabilizer codes. Along the way we also show how Clifford codes can be encoded. We also show that gauge qubits can be exploited to...
متن کاملOn subsystem codes beating the quantum Hamming or Singleton bound
Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the quantum Singleton bound to Fq-linear subsystem codes. It follows that no subsystem code over a prime field can beat the quantum Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the quantum Hamming bound. A...
متن کاملar X iv : q ua nt - p h / 07 03 21 3 v 1 2 2 M ar 2 00 7 On Subsystem Codes Beating the Hamming or Singleton Bound
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for Fqlinear subsystem codes. It follows that no subsystem code over a prime field can beat the Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the Hamming bound. A number of open ...
متن کامل